Infinite complete group presentations
نویسندگان
چکیده
منابع مشابه
Complete Positive Group Presentations
A combinatorial property of prositive group presentations, called completeness, is introduced, with an effective criterion for recognizing complete presentations, and an iterative method for completing an incomplete presentation. We show how to directly read several properties of the associated monoid and group from a complete presentation: cancellativity or existence of common multiples in the...
متن کاملAutomatic presentations of infinite structures
The work at hand studies the possibilities and limitations of the use of finite automata in the description of infinite structures. An automatic presentation of a countable structure consists of a labelling of the elements of the structure by finite words over a finite alphabet in a consistent way so as to allow each of the relations of the structure to be recognised, given the labelling, by a ...
متن کاملSome Challenging Group Presentations
We study some challenging presentations which arise as groups of deeciency zero. In four cases we settle niteness: we show that two presentations are for nite groups while two are for innnite groups. Thus we answer three explicit questions in the literature and we provide the rst published deeciency zero presentation for a group with soluble length seven. The tools we use are coset enumeration ...
متن کاملPower-commutator Presentations for Infinite Sequences Of
For certain infinite sequences of 3-groups G with derived length 2 ≤ dl(G) ≤ 3, and either with G/G′ ' (3, 3), coclass cc(G) ≥ 1, or with G/G′ ' (9, 3), coclass cc(G) ≥ 3, parametrized pc-presentations are given in dependence on the class c = cl(G).
متن کاملOn external presentations of infinite graphs
The vertices of a finite state system are usually a subset of the natural numbers. Most algorithms relative to these systems only use this fact to select vertices. For infinite state systems, however, the situation is different: in particular, for such systems having a finite description, each state of the system is a configuration of some machine. Then most algorithmic approaches rely on the s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 1996
ISSN: 0022-4049
DOI: 10.1016/0022-4049(95)00108-5